On the NP - Completeness of Finding an Optimal Strategy
نویسندگان
چکیده
Given a nite two player game with common payoos (i.e., the players have completely common interests), we show that the problem of determining whether there exists a joint strategy whose expected joint payoo is at least (1; 1) is NP-complete.
منابع مشابه
On the NP-completeness of Finding an Optimal Strategy in Games with Common Payoffs
Consider a very simple class of (finite) games: after an initial move by nature, each player makes one move. Moreover, the players have common interests: at each node, all the players get the same payoff. We show that the problem of determining whether there exists a joint strategy where each player has an expected payoff of at least r is NP-complete as a function of the number of nodes in the ...
متن کاملNew Results on the Complexity of Uniformly Mixed Nash Equilibria
We are interested in the complexity of finding Nash equilibria with one uniformly mixed strategy (that is, equilibria in which at least one played strategy is a uniform probability function). We show that, even in imitation bimatrix games, where one player has a positive payoff if he plays the same pure strategy as the opponent, deciding the existence of such an equilibrium is an NP-complete pr...
متن کاملAn efficient strategy for rapidly finding an object in a polygonal world
In this paper we propose an approach to solve the problem of finding an.object in a polygon which may contain holes. We define an optimal solution as the route that minimizes the expected time it takes to find said object. The object search problem is shown tu be NP-hard by reduction, therefore, we propose the heuristic of an utility function, defined as the ratio of a gain over a cost and an g...
متن کاملThe complexity of greatest common divisor computations
We study the complexity of expressing the greatest common divisor of n positive numbers as a linear combination of the numbers. We prove the NP-completeness of finding an optimal set of multipliers with respect to either the L0 metric or the L∞ norm. We present and analyze a new method for expressing the gcd of n numbers as their linear combination and give an upper bound on the size of the lar...
متن کاملOptimal deterministic auctions with correlated priors
We revisit the problem of designing the profit-maximizing single-item auction, solved by Myerson in his seminal paper for the case in which bidder valuations are independently distributed. We focus on general joint distributions, seeking the optimal deterministic incentive compatible auction. We give a geometric characterization of the optimal auction, resulting in a duality theorem and an effi...
متن کامل